Parameter Block

نویسندگان

  • Gustavo Patow
  • Fernando Lyardet
چکیده

The development of complex software relies -among other thingson well defined interfaces or APIs between the different modules. Unfortunately, as development cycles tend to shorten, the need for greater parallelism of development activities makes it more difficult to have well established APIs, since everything is under construction. This uncertainty introduces a coordination problem for the development team due to continuous corrections and adaptations required to accommodate the updated interfaces and as such, it is costly and error prone. A similar problem occurs when software introduces a plug-in architecture as a mechanism to allow future extensions. In this scenario, it is difficult to determine beforehand the information needs for every possible plug-in. Furthermore, as the number of possible relevant information for the plug-in can be arbitrarily high, it may be not practical to pass all possible parameters. Besides, sometimes it might be necessary that the arguments could be added or removed later, at runtime, in order to avoid cluttering the initial declaration with unused information or allowing expanding the passed parameters list. We could use something like the C++ open argument list, like:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounding the parameters of block-structured nonlinear feedback systems

In this paper a procedure for set-membership identification of block-structured nonlinear feedback systems is presented. Nonlinear block parameter bounds are first computed by exploiting steady-state measurements. Then, given the uncertain description of the nonlinear block, bounds on the unmeasurable inner-signal are computed. Finally, linear block parameter bounds are evaluated on the basis o...

متن کامل

S Parameter Theory of Lossless Block Network

The energy conservation of lossless network reflects a series of novel symmetry in S parameter. This paper presents the generalized modulus symmetry, spurious reciprocity, constant characteristic phase and determinant of the lossless block network. The perfect matching condition of block load network [Γl] and the invariable lossless property of S parameter of generalized block network are devel...

متن کامل

The CBP parameter-a useful annotation to aid block-diagram compilers for DSP

Memory consumption is an important metric during software synthesis from block-diagram specifications of DSP applications. Conventionally, no assumption is made about when during the execution of a functional block (actor), the associated data values (tokens) are actually consumed and produced. However, we show in this paper that it is possible to concisely and precisely capture key properties ...

متن کامل

A short-coding error parameter for channels with block interference

For a class of channels, called block interference channels, a paradoxical situation prevails, namely, the capacity increases but the cutoff rate decreases with an increase of the block interference length. Also, despite the large capacity, there is a degradation in the performance of practical coding schemes when the block interference length is excessive. We introduce a short-coding error par...

متن کامل

Global Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems

The alternating direction method of multipliers (ADMM) has been successfully applied tosolve structured convex optimization problems due to its superior practical performance. Theconvergence properties of the 2-block ADMM have been studied extensively in the literature.Specifically, it has been proven that the 2-block ADMM globally converges for any penaltyparameter γ > 0. In th...

متن کامل

Non-asymptotic analysis of privacy amplification via Rényi entropy and inf-spectral entropy

This paper investigates the privacy amplification problem, and compares the existing two bounds: the exponential bound derived by one of the authors and the min-entropy bound derived by Renner. It turns out that the exponential bound is better than the min-entropy bound when a security parameter is rather small for a block length, and that the min-entropy bound is better than the exponential bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003